A probabilistic and opportunistic flooding algorithm in wireless sensor networks

0140-3664/$ see front matter 2011 Elsevier B.V. A doi:10.1016/j.comcom.2011.11.016 ⇑ Corresponding author. Tel.: +82 2 880 9105; fax: E-mail addresses: [email protected] (D nu.ac.kr (K. Cho), [email protected] (T.‘‘Taekyoung’’ Kwon), [email protected] (Y. Choi). In wireless sensor networks, many communication protocols and applications rely on flooding for various networking purposes. Prior efforts focus on how to design efficient flooding algorithms; that is, they seek to achieve full reliability while reducing the number of redundant broadcasting across the network. To achieve efficient flooding, most of the existing protocols try to reduce the number of transmissions, which is decided without considering any online transmission result. In this paper, we propose a probabilistic and opportunistic flooding algorithm that controls rebroadcasts and retransmissions opportunistically. It seeks to achieve a target reliability required by an application. For this purpose, it makes a given node select only the subset of its one-hop neighbors to rebroadcast the same message. It considers node relations such as link error rates among nodes in selecting eligible neighbors to rebroadcast. The sender controls the number of retransmissions opportunistically by tracking the current status of message reception at its neighbors. Simulation is carried out to reveal that our proposed scheme achieves the given target reliability with less overhead than other flooding algorithms in most cases, thus prolonging the network lifetime. 2011 Elsevier B.V. All rights reserved.